import java.util.LinkedList;


public class PrimsSimpleGraph extends SimpleGraph {
	public PrimsSimpleGraph(){
		
	}
	public void update(Vertex v){
		//make binary heap
		
		
		LinkedList<Edge> thisEdges= v.incidentEdgeList;
		for (Edge x : thisEdges) {
			OurVertex a = (OurVertex) x.getFirstEndpoint();
			OurVertex b = (OurVertex) x.getSecondEndpoint();
			OurVertex neighbor = (this.equalVertices(a, v)) ? a : b;
			int thisVertexIndex = neighbor.getIndex();
			
		}
	}
	
	public static boolean equalVertices(Vertex a, Vertex b) {
		//yes or no;
		return false;
	}
}
